/**
*      author: Y_Yao
*      created: 2025-02-07 21:35:31
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 50 + 7;
int a[N],b[N];
int n;


void solve()
{
    unordered_set<int> s1;
    unordered_set<int> s2;
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        s1.insert(a[i]);
    }
    for(int i = 1;i <= n;i++)
    {
        cin >> b[i];
        s2.insert(b[i]);
    }

    if((s1.size() == 2 && s2.size() == 1) || (s1.size() == 1 && s2.size() == 2))
    {
        cout << "NO" << endl;
        return;
    }
    if(s1.size() == 1 && s2.size() == 1)
    {
        cout << "NO" << endl;
        return;
    }

    cout << "YES" << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}